Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Review on privacy-preserving technologies in federated learning
Teng WANG, Zheng HUO, Yaxin HUANG, Yilin FAN
Journal of Computer Applications    2023, 43 (2): 437-449.   DOI: 10.11772/j.issn.1001-9081.2021122072
Abstract1417)   HTML133)    PDF (2014KB)(1090)       Save

In recent years, federated learning has become a new way to solve the problems of data island and privacy leakage in machine learning. Federated learning architecture does not require multiple parties to share data resources, in which participants only needed to train local models on local data and periodically upload parameters to the server to update the global model, and then a machine learning model can be built on large-scale global data. Federated learning architecture has the privacy-preserving nature and is a new scheme for large-scale data machine learning in the future. However, the parameter interaction mode of this architecture may lead to data privacy disclosure. At present, strengthening the privacy-preserving mechanism in federated learning architecture has become a new research hotspot. Starting from the privacy disclosure problem in federated learning, the attack models and sensitive information disclosure paths in federated learning were discussed, and several types of privacy-preserving techniques in federated learning were highlighted and reviewed, such as privacy-preserving technology based on differential privacy, privacy-preserving technology based on homomorphic encryption, and privacy-preserving technology based on Secure Multiparty Computation (SMC). Finally, the key issues of privacy protection in federated learning were discussed, the future research directions were prospected.

Table and Figures | Reference | Related Articles | Metrics
Current research status and challenges of blockchain in supply chain applications
Lina GE, Jingya XU, Zhe WANG, Guifen ZHANG, Liang YAN, Zheng HU
Journal of Computer Applications    2023, 43 (11): 3315-3326.   DOI: 10.11772/j.issn.1001-9081.2022111758
Abstract365)      PDF (2371KB)(438)       Save

The supply chain faces many challenges in the development process, including how to ensure the authenticity and reliability of information as well as the security of the traceability system in the process of product traceability, the security of products in the process of logistics, and the trust management in the financing process of small and medium enterprises. With characteristics of decentralization, immutability and traceability, blockchain provides efficient solutions to supply chain management, but there are some technical challenges in the actual implementation process. To study the applications of blockchain technology in the supply chain, some typical applications were discussed and analyzed. Firstly, the concept of supply chain and the current challenges were briefly introduced. Secondly, problems faced by blockchain in three different supply chain fields of information flow, logistics flow and capital flow were described, and a comparative analysis of related solutions was given. Finally, the technical challenges faced by blockchain in the practical applications of supply chain were summarized, and future applications were prospected.

Reference | Related Articles | Metrics
Personalized recommendation technique for mobile life services based on location cluster
ZHENG Hui, LI Bing, CHEN Donglin, LIU Pingfeng
Journal of Computer Applications    2015, 35 (4): 1148-1153.   DOI: 10.11772/j.issn.1001-9081.2015.04.1148
Abstract625)      PDF (842KB)(571)       Save

Current mobile recommendation systems limit the real role of location information, because the systems just take location as a general property. More importantly, the correlation of location and the boundary of activities of users have been ignored. According to this issue, personalized recommendation technique for mobile life services based on location cluster was proposed, which considered both user preference in its location cluster and the related weight by forgetting factor and information entropy. It used fuzzy cluster to get the location cluster, then used forgetting factor to adjust the preference of the service resources in the location cluster. Then the related weight was obtained by using probability distribution and information entropy. The top-N recommendation set was got by matching the user preference and service resources. As a result, the algorithm can provide service resources with high similarities with user preference. This conclusion has been verified by case study.

Reference | Related Articles | Metrics
Method of marine radar image simulation based on electronic chart display information system
WAGN Shengzheng HUANG Yugui
Journal of Computer Applications    2014, 34 (10): 3024-3028.   DOI: 10.11772/j.issn.1001-9081.2014.10.3024
Abstract210)      PDF (806KB)(363)       Save

To meet the requirements of the military and merchant marine radar simulation, and enhance the simulation reality of radar image, a real-time scan simulation approach based on sector-banded texture blending model was presented to simulate highly realistic radar echo image. In this method, Electronic Navigation Chart (ENC) was regarded as the resource data of the radar echo signal, and according to the principle of the radar echo, the sector-banded texture blending algorithm was proposed to replace the traditional radar image simulation method based on the pixel-scan model and generate the radar echo texture data. Based on that, the simulation models of the radar echo signal processing were presented to implement the basic functions of the marine radar, such as gain adjustment, sea clutter suppression and rain/snow clutter suppression. The experimental results show the proposed approach improves distinctly the efficiency and effectiveness of the radar echo simulation, and it is a promising means to address the problem of radar and Electronic Chart Display Information System (ECDIS) simulation.

Reference | Related Articles | Metrics
Parallel Delaunay algorithm design in lunar surface terrain reconstruction system
WANG Zhe GAO Sanhong ZHENG Huiying LI Lichun
Journal of Computer Applications    2013, 33 (08): 2177-2183.  
Abstract743)      PDF (1078KB)(582)       Save
Triangulation procedure is one of the time bottle-necks of 3D reconstruction system. To increase the speed of triangulation procedure, a parallel Delaunay algorithm was designed based on a shared memory multi-core computer. The algorithm employed divide-and-conquer method and improved conquer procedure and Delaunay mesh optimization procedure to avoid data competition problem. Experiments were conducted on datasets with range from 500000 to 5000000 gathered on the lunar surface simulation ground, and the speedup of the algorithm reached 6.44. In addition, the algorithm complexity and parallel efficiency were fully analyzed and the algorithm was applied in the lunar surface terrain reconstruction system to realize fast virtual terrain reconstruction.
Reference | Related Articles | Metrics
Color image enhancement based on improved intersecting cortical model
PU Tian LI Ying-hua CHENG Jian ZHENG Hu
Journal of Computer Applications    2012, 32 (11): 3153-3156.   DOI: 10.3724/SP.J.1087.2012.03153
Abstract898)      PDF (686KB)(447)       Save
To meet the physiological perception of human eyes, a color image enhancement algorithm based on improved Intersecting Cortical Model (ICM) was proposed. The internal activities and dynamic threshold were improved to nonlinear attenuation, which satisfied the nonlinear perception of human eyes. And the decay factor was replaced by the step factor, while maintaining some of the significant features of the original model. It applied the Threshold Versus Intensity (TVI) function of the human visual system on the intensity component of the input image to adjust the dynamic range compression. At the same time, it also adjusted the saturation component of the input image by nonlinearity. Compared to the original ICM, this algorithm reduced the complexity and improved the adaptability. The experimental results confirm that the method can obtain clear and bright results.
Reference | Related Articles | Metrics
Group path planning method based on improved group search optimization algorithm
ZHENG Hui-jie LIU Hong ZHENG Xiang-wei
Journal of Computer Applications    2012, 32 (08): 2223-2226.   DOI: 10.3724/SP.J.1087.2012.02223
Abstract1089)      PDF (608KB)(383)       Save
Concerning the problems that traditional path planning of group animation needs long time for searching and is of poor optimization, the authors proposed a multi-threaded path planning algorithm based on group search optimization. Firstly, to solve the problem that the algorithm easily gets trapped in local optimum, metroplis rule was introduced in this search mode. Secondly, by using random path through the multi-threading and stitching techniques, the algorithm was applied to path planning. The simulation results show that the algorithm has better global convergence both in high-dimensional and low-dimensional cases, and the method is good enough to meet the requirements of path planning in complex animation environment.
Reference | Related Articles | Metrics